Module-LWE key exchange and encryption: The three bears
نویسنده
چکیده
We propose a new post-quantum key exchange algorithm based on the module learning with errors (mLWE) problem. Our ThreeBears algorithm is simple and performant, but our main goal is to suggest mLWE over a generalized Mersenne field instead of a polynomial ring. We also show how to build a public-key encryption system from the key exchange algorithm.
منابع مشابه
CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM
Recent advances in quantum computing and the announcement by the National Institute of Standards and Technology (NIST) to define new standards for digital-signature, encryption, and keyestablishment protocols increased interest in post-quantum cryptographic schemes. This paper introduces Kyber (part of the CRYSTALS – Cryptographic Suite for Algebraic Lattices – package that will be submitted to...
متن کاملMultilinear Maps Using a Variant of Ring-LWE
GGH13, CLT13 and GGH15 of multilinear maps suffer from zeroizing attacks. In this paper, we present a new construction of multilinear maps using a variant of ring-LWE (vRLWE). Furthermore, we also present two new variants of vRLWE, which respectively support the applications of multipartite key exchange and witness encryption. At the same time, we also present a new variant of GGH13 using matri...
متن کاملOptimal Key Consensus in Presence of Noise
In this work, we abstract some key ingredients in previous key exchange protocols based on LWE and its variants, by introducing and formalizing the building tool, referred to as key consensus (KC) and its asymmetric variant AKC. KC and AKC allow two communicating parties to reach consensus from close values obtained by some secure information exchange. We then discover upper bounds on parameter...
متن کاملHILA5: On Reliability, Reconciliation, and Error Correction for Ring-LWE Encryption
We describe a new reconciliation method for Ring-LWE that has a significantly smaller failure rate than previous proposals while reducing ciphertext size and the amount of randomness required. It is based on a simple, deterministic variant of Peikert’s reconciliation that works with our new “safe bits” selection and constant-time error correction techniques. The new method does not need randomi...
متن کاملA New Ring-Based SPHF and PAKE Protocol On Ideal Lattices
emph{ Smooth Projective Hash Functions } ( SPHFs ) as a specific pattern of zero knowledge proof system are fundamental tools to build many efficient cryptographic schemes and protocols. As an application of SPHFs, emph { Password - Based Authenticated Key Exchange } ( PAKE ) protocol is well-studied area in the last few years. In 2009, Katz and Vaikuntanathan described the first lattice-based ...
متن کامل